/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: YKH
 * Date: 2022-06-24
 * Time: 20:47
 */
public class Main {
    public static void main(String[] args) {
        int [] arr = {11,22,51,0,6,3};
        BinarySearchTree searchTree = new BinarySearchTree();
        for(int i=0 ;i< arr.length;i++) {
            searchTree.insert(arr[i]);
        }
        searchTree.inorder(searchTree.root);
    }
}
